Spanning tree - PDFSEARCH.IO - Document Search Engine

Spanning tree
Results: 445

#	Item
71	Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates. Silvio Frischknecht Stephan Holzer Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:35 Graph theory Mathematics Edsger W. Dijkstra Spanning tree Combinatorial optimization Network theory Shortest path problem Connectivity Distributed computing Minimum spanning tree Clique Matching
72	GraphLab: A New Framework For Parallel Machine Learning Yucheng Low Carnegie Mellon University Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2010-06-15 17:18:40 Graph theory Concurrent computing Mathematics Parallel computing Distributed computing architecture NP-complete problems Graph connectivity MapReduce Speedup Graph coloring Spanning tree Graph partition
73	JMLR: Workshop and Conference Proceedings vol 40:1–20, 2015 S2 : An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification Gautam Dasarathy Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Graph connectivity Graph theory Edsger W. Dijkstra Network theory Shortest path problem Bridge Connected component Connectivity Graph Routing algorithms Planar separator theorem Minimum spanning tree
74	CSc 220: Algorithms Homework 8 Solutions Problem 1: A min-max spanning tree of an undirected weighted graph G, is a spanning tree T for G that minimizes the weight of the ”heaviest” edget in T . In other words: defin Add to Reading List Source URL: www-cs.ccny.cuny.edu Language: English - Date: 2015-12-12 10:11:00
75	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph
76	November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2010-02-02 11:52:14 Network theory Edsger W. Dijkstra Graph connectivity Routing algorithms Spanning tree Graph Shortest path problem Strongly connected component Cycle Longest path problem Connected component FloydWarshall algorithm
77	4.5 Minimum Spanning Tree Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Add to Reading List Source URL: cgm.cs.mcgill.ca Language: English - Date: 2012-01-09 15:08:28
78	Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2015-12-01 10:37:13 Matching Combinatorics NP-complete problems Combinatorial optimization Spanning tree Stable marriage problem Approximation algorithm 3-dimensional matching Minimum spanning tree
79	December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:09:13 Graph theory Mathematics Computational complexity theory Network theory Spanning tree NP-complete problems Edsger W. Dijkstra Shortest path problem Longest path problem Minimum spanning tree Reverse-delete algorithm
80	The scaling limit of the minimum spanning tree of the complete graph L. Addario-Berry∗, N. Broutin†, C. Goldschmidt‡, G. Miermont§ January 8, 2013 Abstract Consider the minimum spanning tree (MST) of the complete Add to Reading List Source URL: who.rocq.inria.fr Language: English - Date: 2014-07-14 05:27:02

UPDATE